Non-Obfuscated Unprovable Programs & Many Resultant Subtleties
نویسندگان
چکیده
منابع مشابه
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties
The International Obfuscated C Code Contest was a programming contest for the most creatively obfuscated yet succinct C code. By contrast, an interest herein is in programs which are, in a sense, easily seen to be correct, but which cannot be proved correct in pre-assigned, computably axiomatized, powerful, true theories T. A point made by our first theorem, then, is that, then, unverifiable pr...
متن کاملLongitudinal subtleties in diffusive Langevin equations for non-Abelian plasmas
Bödeker has recently argued that non-perturbative processes in very high temperature non-Abelian plasmas (such as electroweak baryon number violation in the very hot early Universe) can be quantitatively described, to leading logarithmic accuracy, by a simple diffusive effective theory. Bödeker’s effective theory is only intended to describe long-distance transverse electric and magnetic fields...
متن کاملTransforming Programs between APIs with Many-to-Many Mappings
Transforming programs between two APIs or different versions of the same API is a common software engineering task. However, existing languages support for such transformation cannot satisfactorily handle the cases when the relations between elements in the old API and the new API are many-to-many mappings: multiple invocations to the old API are supposed to be replaced by multiple invocations ...
متن کاملThe Collatz 3n+1 Conjecture Is Unprovable
In this paper, we show that any proof of the Collatz 3n + 1 Conjecture must have an infinite number of lines. Therefore, no formal proof is possible. We also discuss whether the proof strategy in this paper has any promise for proving that the Riemann Hypothesis is also unprovable.
متن کاملCAOS: Concurrent-Access Obfuscated Store
This paper proposes Concurrent-Access Obfuscated Store (CAOS), a construction for remote data storage that provides access-pattern obfuscation in a honest-but-curious adversarial model, while allowing for low bandwidth overhead and client storage. Compared to the state of the art, the main advantage of CAOS is that it supports concurrent access without a proxy, for multiple read-only clients an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2016
ISSN: 1860-5974
DOI: 10.2168/lmcs-12(2:2)2016